Colorings and orientations of graphs
نویسندگان
چکیده
Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In particular, the following result is proved: If G is a directed graph with maximum outdegree d, and if the number of Eulerian subgraphs of G with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges then for any assignment of a set S(v) of d+ 1 colors for each vertex v of G there is a legal vertex-coloring of G assigning to each vertex v a color from S(v).
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملColorings and Orientations of Matrices and Graphs
We introduce colorings and orientations of matrices as generalizations of the graph theoretic terms. The permanent per(A[ζ|ξ]) of certain copies A[ζ|ξ] of a matrix A can be expressed as a weighted sum over the orientations or the colorings of A . When applied to incidence matrices of graphs these equations include Alon and Tarsi’s theorem about Eulerian orientations and the existence of list co...
متن کاملNowhere-harmonic Colorings of Graphs
Abstract. Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic colorings and analogues of the chromatic polynomial and Stanley’s theorem relating negative evaluations of the chromatic polynomial to acyclic orientatio...
متن کاملPolynomials associated with graph coloring and orientations
We study colorings and orientations of graphs in two related contexts. Firstly, we generalize Stanley’s chromatic symmetric function XG [17] using the kbalanced colorings of Pretzel [12] to create a new graph invariant Xk G. We show that in fact Xk G is a quasisymmetric function which has a positive expansion in the fundamental basis. We also define a graph invariant χk G generalizing the chrom...
متن کاملFlexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants
We present a purely combinatorial proof of Alon and Tarsi’s Theorem about list colorings and orientations of graphs. More precisely, we describe a winning strategy for Mrs. Correct in the corresponding coloring game of Mr. Paint and Mrs. Correct. This strategy produces correct vertex colorings, even if the colors are taken from lists that are not completely fixed before the coloration process s...
متن کاملNot So Easy Problems for Tree Decomposable Graphs
We consider combinatorial problems for graphs that (a) can be solved in polynomial time for graphs of bounded treewidth and (b) where the order of the polynomial time bound is expected to depend on the treewidth of the considered graph. First we review some recent results for problems regarding list and equitable colorings, general factors, and generalized satisfiability. Second we establish a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 12 شماره
صفحات -
تاریخ انتشار 1992